A simple Hankel interpretation of the Berlekamp-Massey algorithm
نویسندگان
چکیده
منابع مشابه
Generalised Berlekamp-Massey algorithm
The BerlekampMassey algorithm is revisited and proven again by using the matrix representation. This approach makes the derivation and proof of the algorithm straightforward, simple and easily understood. It further enables the presentation of a generalised Berlekamp Massey algorithm, including the conventional algorithm and the inversion-free algorithm as two special cases. -,
متن کاملA On The Matrix Berlekamp-Massey Algorithm
We analyze the Matrix Berlekamp/Massey algorithm, which generalizes the Berlekamp/Massey algorithm [Massey 1969] for computing linear generators of scalar sequences. The Matrix Berlekamp/Massey algorithm computes a minimal matrix generator of a linearly generated matrix sequence and has been first introduced by [Rissanen 1972a], [Dickinson et al. 1974] and [Coppersmith 1994]. Our version of the...
متن کاملOn the Berlekamp/Massey algorithm and counting singular Hankel matrices over a finite field
We derive an explicit count for the number of singular n × n Hankel (Toeplitz) matrices whose entries range over a finite field with q elements by observing the execution of the Berlekamp/ Massey algorithm on its elements. Our method yields explicit counts also when some entries above or on the anti-diagonal (diagonal) are fixed. For example, the number of singular n × n Toeplitz matrices with ...
متن کاملA Fraction Free Matrix Berlekamp/Massey Algorithm*
We describe a fraction free version of the Matrix Berlekamp/Massey algorithm. The algorithm computes a minimal matrix generator of linearly generated square matrix sequences over an integral domain. The algorithm performs all operations in the integral domain, so all divisions performed are exact. For scalar sequences, the matrix algorithm specializes to a more efficient algorithm than the algo...
متن کاملThe Berlekamp-Massey Algorithm via Minimal Polynomials
We present a recursive minimal polynomial theorem for finite sequences over a commutative integral domain D. This theorem is relative to any element of D. The ingredients are: the arithmetic of Laurent polynomials over D, a recursive ’index function’ and simple mathematical induction. Taking reciprocals gives a ’Berlekamp-Massey theorem’ i.e. a recursive construction of the polynomials arising ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1989
ISSN: 0024-3795
DOI: 10.1016/0024-3795(89)90032-3